Genealogy of hard real-time preemptive scheduling algorithms for identical multiprocessors

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact Schedulability Test for global-EDF Scheduling of Periodic Hard Real-Time Tasks on Identical Multiprocessors

Over the years, the preemptive periodic constrained-deadline task model [9] has proven remarkably useful for the modeling of recurring processes that occur in hard real-time computer application systems, where the failure to satisfy any constraint may have disastrous consequences. The problem of scheduling such tasks upon a single processor (CPU) so that all the deadlines are met has been widel...

متن کامل

Online Hard Real-Time Scheduling for Hypercube Multiprocessors

Scheduling sporadic tasks is a formidable problem in hard real-time systems, particularly multiprocessor systems. Until now little research has addressed this problem for hypercube multiprocessors. In this paper we study two online scheduling algorithms-Buddy/RT and Stacking, for hard real-time environments which provide guarantees at the time of arrival of a task. Buddy/RT is a straightforward...

متن کامل

Preemptive LCFS Scheduling in Hard Real-Time Applications

Blieberger, J. and U . Schmid, Preemptive LCFS scheduling in hard real-time applications, Performance Evaluation 15 (1992) 203-215 . We investigate the real-time behaviour of a (discrete time) single server system with preemptive LCFS task scheduling . The main result deals with the probability distribution of a random variable SRD(T), which describes the time the system operates without violat...

متن کامل

Implementing Hard Real-Time Transactions on Multiprocessors

We present a new approach to implementing real-time transactions on memory-resident data on sharedmemory multiprocessors. This approach allows hard deadlines to be supported without undue overhead. In our approach, transactions are implemented by invoking wait-free library routines. Concurrency control is embedded within these routines, so no special support for data management is required of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Open Computer Science

سال: 2011

ISSN: 2299-1093

DOI: 10.2478/s13537-011-0023-z